Self-Healing as a Combination of Consistency Checks and Conformant Planning Problems
نویسنده
چکیده
We introduce the problem of self healing, in which a system is asked to self diagnose and self repair. The two problems of computing the diagnosis and the repair are often solved separately. We show in this paper how to tie these two tasks together: a planner searches a prospective plan on a sample of the belief state; a diagnoser verifies the applicability of the plan and returns a state of the belief state (added to the sample) in which the plan is not applicable. This decomposition of the self healing process avoids the explicit computation of the belief state. Our experiments demonstrate that it scales much better than the traditional approach.
منابع مشابه
Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations
Optimal planners in the classical setting are built around two notions: branching and pruning. SAT-based planners for example branch by trying the values of a selected variable, and prune by propagating constraints and checking consistency. In the conformant setting, a similar branching scheme can be used if restricted to action variables, but the pruning scheme must be modified. Indeed, prunin...
متن کاملPlanning Graph Heuristics for Scaling Up Conformant Planning
This paper describes a set of heuristics for efficiently solving conformant planning problems. Conformant planning, as described in this paper extends classical planning to problems where there is uncertainty in the initial state. The motivation for improved heuristic techniques stems from the observation that previous conformant planners used largely uninformed heuristics. We show that the rea...
متن کاملPhase Transitions of Plan Modification in Conformant Planning
We explore phase transitions of plan modification, which mainly focus on the conformant planning problems. By analyzing features of plan modification in conformant planning problems, quantitative results are obtained. If the number of operators is less than ub , almost all conformant planning problems can’t be solved with plan modification. If the number of operators is more than lb , almos...
متن کاملFostering product development using combination of QFD and ANP: A case study
In this ever changing business scenario, success of the company lies in understanding the customer preferences, tastes and anticipating the changes required in existing or new products being offered. It was desired to develop a model which allows decision makers to decompose a complex problem in a hierarchical structure to show the relationship of the goals, objectives, criteria and alternative...
متن کاملA New Approach to Conformant Planning via Classical Planners
In this paper, we introduce a new approach to conformant planning via classical planners. We view a conformant planning problem as a set of classical planning problems, called sub-problems, and solve it using a generate-and-complete algorithm. Key to this algorithm is a procedure which takes a solution of a sub-problem and generates a solution for other sub-problems. We implement this algorithm...
متن کامل